Max - Planck - Institut für Mathematik in den Naturwissenschaften Leipzig Random Graphs
نویسنده
چکیده
We introduce and analyze a particular generalization of the Erdös-Rényi random graph model that is based on adding not only edges but also copies of small graphs onto the nodes of a graph. The resulting model is analytically tractable and can generate random graphs with local structures that are not tree like. First, we introduce the simplest generalization called the triplet model corresponding to the addition of three node subgraphs and investigate some of its key properties. In the undirected model we obtain a random graph with non-zero clustering and assortativity while in the directed case we obtain a graph with triangular motifs. Then, we formulate our model in its full generality by allowing the addition of graphs of arbitrary size and generalize the results obtained for the triplet model.
منابع مشابه
Max - Planck - Institut für Mathematik in den Naturwissenschaften Leipzig Improved lower and upper bounds for entanglement of formation
متن کامل
Max - Planck - Institut für Mathematik in den Naturwissenschaften Leipzig Immunity space generated by a non trivial genetic - antigenic relation
متن کامل
Max - Planck - Institut für Mathematik in den Naturwissenschaften Leipzig Method for measuring the entanglement of formation for arbitrary - dimensional pure states
متن کامل
Discrepancy of Products of Hypergraphs
Discrepancy of Products of Hypergraphs Benjamin Doerr, Michael Gnewuch and Nils Hebbinghaus Max-Planck-Institut für Informatik, Stuhlsatzenhausweg 85, D-66123 Saarbrücken, e-mail: [email protected] Max-Planck-Institut für Mathematik in den Naturwissenschaften, Inselstraße 22, D-04103 Leipzig, e-mail: [email protected] Institut für Informatik und Praktische Mathematik, Christian-Albrechts-Uni...
متن کاملMax - Planck - Institut für Mathematik in den Naturwissenschaften Leipzig Representation of Markov chains by random
We systematically investigate the problem of representing Markov chains by families of random maps, and what regularity of these maps can be achieved depending on the properties of the probability measures. Our key idea is to use techniques from optimal transport to select optimal such maps. Optimal transport theory also tells us how convexity properties of the supports of the measures translat...
متن کامل